An Epistemic - Geometric Extension of Game Logic

نویسندگان

  • Can Başkent
  • Rohit Parikh
چکیده

The notions of uncertainty and closeness have long played an important role in games. Many games such as dart and 20Q involve uncertainty and, furthermore one can describe a notion of closeness in such games. Closeness of the dart to the aim or closeness of the golf ball to the hole can be considered as the instances of the situations that involve uncertainty. In dart, for instance, a player cannot guarantee that he will be able to hit the aim precisely. However, he can guarantee that he will be able to hit a point within a neighborhood about the aim. Such neighborhoods vary from player to player, from move to move. Players can improve their skills to make the neighborhood smaller. In some situations players can guarantee a certain “point” once the neighborhood entirely lies in a certain section of the dart board. Nevertheless, game logics which have been suggested and discussed so far do not involve such components in their semantics in order to be able to formalize the uncertainty and closeness in games. In this preliminary report, our aim is to make use of epistemic logical apparatus in the context of game logic in order to give an epistemic-geometric semantics for games that involve uncertainty. Some previous work, on the other hand, tend to converge to our current agenda where the logic of epistemic programs were discussed extensively with dynamic epistemic logical concerns and puzzles in Kripke structures (Baltag & Moss, 2004). We also have a hidden agenda. This work can immediately be considered as a first step towards a geometrical (or even topological) semantics for propositional dynamic logic (PDL, henceforth). The reason for that is the fact that game logic is an extension of PDL with an additional operator for duality. However, the additional operator in the game logic is not trivial as the completeness proof of game logic with dual has not yet been given. The organization of the paper is as follows. We first introduce the basics of game logic and subset space logic where the latter is the basis of our geometric and epistemic semantics. Then, we discuss our extension of game logic where we extend the basic language with epistemic modalities and make use of a geometrical semantics. Finally, we will conclude with some future research directions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Public Announcement Logics

In this paper, we consider public announcement logic (PAL, henceforth) in several different geometric models, and prove its completeness of those models. Moreover, we also consider some applications of our ideas in different fields varying from game theory to epistemic logic. What makes our work novel is the fact that PAL has never been investigated in geometric and topological models with furt...

متن کامل

Reasoning about Knowledge and Strategies: Epistemic Strategy Logic

In this paper we introduce Epistemic Strategy Logic (ESL), an extension of Strategy Logic with modal operators for individual knowledge. This enhanced framework allows us to represent explicitly and to reason about the knowledge agents have of their own and other agents’ strategies. We provide a semantics to ESL in terms of epistemic concurrent game models, and consider the corresponding model ...

متن کامل

A Temporal Logic of Strategic Knowledge

The paper presents an extension of temporal epistemic logic that adds “strategic” agents in a way that allows standard epistemic operators to capture what agents could deduce from knowledge of the strategies of some subset of the set of agents. A number of examples are presented to demonstrate the broad applicability of the framework, including reasoning about implementations of knowledge-based...

متن کامل

Model Checking Games for a Fair Branching-Time Temporal Epistemic Logic

Model checking games are instances of Hintikka’s game semantics for logic used for purposes of debugging systems verification models. Previous work in the area has developed these games for branching time logic. The paper develops an extension to a logic that adds epistemic operators, and interprets the branching time operators with respect to fairness constraints. The implementation of the ext...

متن کامل

Playing equilibria: What’s the outcome function, again?

We propose a logic where the players may not know the outcome function of the strategic game being played. It is an epistemic extension of games of propositional control. The main contribution of the paper is to lay down a logical framework for the combined analysis of (1) game theoretic properties of strategic games and (2) epistemic properties. The logic enables reasoning about agents and coa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009